Number of quantifiers is better than number of tape cells
نویسندگان
چکیده
منابع مشابه
Number Agreement with Weak Quantifiers in Basque
Whereas (3a), involving a definite quantity, triggers plural agreement, (3b), which involves a nondefinite quantity (equivalent to thousands of in English), only optionally triggers agreement. Cardinal Qs, in the varieties we focus on here, always trigger plural agreement. Vague Qs constructed out of them, on the other hand, may not. The present paper offers a preliminary analysis of the phenom...
متن کاملfinite simple groups with number of zeros slightly greater than the number of nonlinear irreducible characters
the aim of this paper is to classify the finite simple groups with the number of zeros at most seven greater than the number of nonlinear irreducible characters in the character tables. we find that they are exactly a$_{5}$, l$_{2}(7)$ and a$_{6}$.
متن کاملThe Role of Number Notation: Sign-Value Notation Number Processing is Easier than Place-Value
Number notations can influence the way numbers are handled in computations; however, the role of notation itself in mental processing has not been examined directly. From a mathematical point of view, it is believed that place-value number notation systems, such as the Indo-Arabic numbers, are superior to sign-value systems, such as the Roman numbers. However, sign-value notation might have suf...
متن کاملQuantifiers for randomness of chaotic pseudo-random number generators.
We deal with randomness quantifiers and concentrate on their ability to discern the hallmark of chaos in time series used in connection with pseudo-random number generators (PRNGs). Workers in the field are motivated to use chaotic maps for generating PRNGs because of the simplicity of their implementation. Although there exist very efficient general-purpose benchmarks for testing PRNGs, we fee...
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1981
ISSN: 0022-0000
DOI: 10.1016/0022-0000(81)90039-8